Independency relationships and learning algorithms for singly connected networks
نویسندگان
چکیده
منابع مشابه
Independency relationships and learning algorithms for singly connected networks
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e ciently perform reasoning tasks. Singly connected networks are important speci ® c cases where there is no more than one undirected path connecting each pair of variables. The aim of this paper is to investigate the kind o...
متن کاملIndependency Relationships in Singly Connected Networks
Graphical structures such as causal networks or Markov networks are very useful tools for representing irrelevance or independency relationships. Singly connected networks are important speciic cases where there is no more than one undirected path connecting each pair of variables. The aim of this paper is to investigate the kind of properties that a dependency model must verify in order to be ...
متن کاملTrust Classification in Social Networks Using Combined Machine Learning Algorithms and Fuzzy Logic
Social networks have become the main infrastructure of today’s daily activities of people during the last decade. In these networks, users interact with each other, share their interests on resources and present their opinions about these resources or spread their information. Since each user has a limited knowledge of other users and most of them are anonymous, the trust factor plays an import...
متن کاملDistributed algorithms for connected domination in wireless networks
We present fast distributed local control Connected Dominating Set (CDS) algorithms for wireless ad hoc networks. We present two randomized distributed algorithms, CDSColor and CDSTop which take into account the effect of wireless interference and the consequent loss of messages during the execution of the algorithm. These algorithms produce a CDS of constant size and constant stretch ratio wit...
متن کاملParameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks
We study an NP-hard problem motivated by energy-efficiently maintaining the connectivity of a symmetric wireless sensor communication network. Given an edge-weighted n-vertex graph, find a connected spanning subgraph of minimum cost, where the cost is determined by letting each vertex pay the most expensive edge incident to it in the subgraph. We provide an algorithm that works in polynomial ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Experimental & Theoretical Artificial Intelligence
سال: 1998
ISSN: 0952-813X,1362-3079
DOI: 10.1080/095281398146743